Minimal cohesive basic sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cohesive Sets: Countable and Uncountable

We show that many uncountable admissible ordinals (including some cardinals) as well as all countable admissible ordinals have cohesive subsets. Exactly which cardinals have cohesive subsets, however, is shown to depend on set-theoretic assumptions such as V=L or a large cardinal axiom. The study of recursion theory on the ordinals was initiated by Takeuti and then generalized by several others...

متن کامل

counterexamples in a−minimal sets

several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.

متن کامل

Minimal closed sets and maximal closed sets

Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal op...

متن کامل

Ternary Basic Digit Sets

A radix representation of a real number, for an integral base B ≥ 2 and digit set D, is a string of digits (an...a1a0...)B = ∑∞ i=−n a−iB , with ak ∈ D. It is commonly known that using a digit set of the form {0, 1, ..., B−1}, any positive real number has a B-ary radix representation. This is simply the standardB-ary representation of a number. Alternative digit representations have been of pra...

متن کامل

Minimal Separating Sets for

For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1974

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s001309150001539x